1 Invariant Maximal Cliques and Incompleteness
نویسنده
چکیده
The Invariant Maximal Clique Theorem asserts that every graph on Q[0,n] with a specific invariance condition has a maximal clique with another specific invariance condition. Here Q[0,n] consists of the rationals in the interval [0,n]. The invariance conditions are all given by equivalence relations involving only < on [0,n] and the distinguished elements 1,...,n. We prove the Invariant Maximal Clique Theorem using a certain well studied set theoretic hypothesis that goes well beyond the usual axioms for mathematics. The proof is modified so as to rely only on the assumption that this hypothesis is free of contradiction. We show that the Invariant Maximal Clique Theorem is, in fact, equivalent to a slight weakening of this consistency assumption.
منابع مشابه
Invariant Maximal Cliques and Incompleteness
The Invariant Maximal Clique Theorem asserts that every graph on Q[0,n] with a specific invariance condition has a maximal clique with another specific invariance condition. Here Q[0,n] consists of the rationals in the interval [0,n]. The invariance conditions are all given by equivalence relations involving only < on [0,n] and the distinguished elements 1,...,n. We prove the Invariant Maximal ...
متن کاملUNIVERSAL PROPERTIES AND INCOMPLETENESS by
Every order invariant subset of Q[-r,r] has a maximal square whose sections at the x ∈ {0,...,r} agree below 0. Every universal property of the f::Q[-n,n] → Q[n,n] with no constants, has a 1-maximal regressive solution with f(0,...,n-1) ≡ f(1,...,n). We prove such purely order theoretic statements in the rationals within ZFC augmented with a standard large cardinal hypothesis, and show that ZFC...
متن کاملAn Approach to Deriving Maximal Invariant Statistics
Invariance principles is one of the ways to summarize sample information and by these principles invariance or equivariance decision rules are used. In this paper, first, the methods for finding the maximal invariant function are introduced. As a new method, maximal invariant statistics are constructed using equivariant functions. Then, using several equivariant functions, the maximal invariant...
متن کامل1 Order Invariant Relations and Incompleteness
Every order invariant subset of Q[0,n] has a maximal square whose sections at any (i,...,n1),(i+1,...,n) agree below i. Every order invariant graph on Q[0,n] has a maximal clique whose sections at any (i,...,n-1),(i+1,...,n) agree below i. We prove these and closely related statements, including a finite form, in extensions of the usual ZFC axioms for mathematics with standard large cardinal hy...
متن کاملMathematically Natural Concrete Incompleteness
Every order invariant R ⊆ Q has a maximal nonnegative root, where S1...n|>n = S0...n-1|>n. Every order invariant R ⊆ Q has a # basis containing its upper shift. These are proved here by going well beyond the usual ZFC axioms for mathematics, using the consistency of the system SRP (Con(SRP)). Here SRP is the extension of ZFC by certain well studied large cardinal hypotheses (existence of cardin...
متن کامل